排序方式: 共有157条查询结果,搜索用时 62 毫秒
141.
数字时代的到来正在改变创业行为和结果,但此背景下创业企业与用户互动以实现价值创造的机制还处于理论探索阶段。基于此,本文从创业机会开发视角出发,以尚品宅配和小米为案例研究对象,构建“价值主张—互动—创业机会开发—价值实现”研究框架。研究发现:机会开发由创业企业与用户共同完成,用户被纳入价值主张、创造环节,并共享价值创造成果;创业企业与用户形成两条价值共创路径,即创业企业与用户发现和创造创业机会实现价值共创;在机会开发过程中,数字化情境为两者互动形成创业机会提供基础桥梁。本文引入“创业机会”这个重要概念解释价值共创机制,尝试打开数字时代下创业企业和用户互动形成价值创造的理论黑箱,为创业企业有效协调与用户之间的关系提供启示。 相似文献
142.
143.
144.
基于市场结构与商品消费结构特点,中小生产商、零售商从关联性功能互补商品特征角度,通过商品零售终端进行战略联盟和商品组合,产生的相互贡献形成的稳定协同"粘性"结构.可以引导中小生产商、零售商通过零售终端战略联盟(连锁)集团组织(FRR)范式参与市场竞争.该范式不仅为资源互补型经济组织的战略联盟提供了理论依据.而且对调节目前市场结构,促进市场经济发展具有较为积极意义. 相似文献
145.
Shuo Zhang Xiaofeng Gao Weili Wu Jianzhong Li Hong Gao 《Journal of Combinatorial Optimization》2011,21(2):159-191
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query
q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing
make it challenging to efficiently processing supergraph queries. In this paper, a new approach to processing supergraph queries
is proposed. Specifically, a method for compactly organizing graph databases is first presented. Common subgraphs of the graphs
in a database are stored only once in the compact organization of the database, in order to reduce the overall cost of subgraph
isomorphism testings from the stored graphs to queries during query processing. Then, an exact algorithm and an approximate
algorithm for generating the significant feature set with optimal order are proposed, followed by the algorithms for indices
construction on graph databases. The optimal order on the feature set is to reduce the number of subgraph isomorphism testings
during query processing. Based on the compact organization of graph databases, a novel algorithm for testing subgraph isomorphisms
from multiple graphs to one graph is presented. Finally, based on all the above techniques, a query processing method is proposed.
Analytical and experimental results show that the proposed algorithms outperform the existing similar algorithms by one to
two orders of magnitude. 相似文献
146.
We study a joint capacity leasing and demand acceptance problem in intermodal transportation. The model features multiple sources of evolving supply and demand, and endogenizes the interplay of three levers—forecasting, leasing, and demand acceptance. We characterize the optimal policy, and show how dynamic forecasting coordinates leasing and acceptance. We find (i) the value of dynamic forecasting depends critically on scarcity, stochasticity, and volatility; (ii) traditional mean‐value equivalence approach performs poorly in volatile intermodal context; (iii) mean‐value‐based forecast may outperform stationary distribution‐based forecast. Our work enriches revenue management models and applications. It advances our understanding on when and how to use dynamic forecasting in intermodal revenue management. 相似文献
147.
本文在分析机构投资者持股情景对投资效率影响机理的基础上,实证检验机构投资者持股情景(机构投资者持股结构、基金持股期限和公司中机构投资者持股比例)对现金富余公司过度投资和现金短缺公司投资不足的作用。结果发现:相比于非基金,基金持股可缓解现金短缺公司的投资不足;相比于短线型基金,长线型基金既可抑制现金富余公司的过度投资,又可减缓现金不足公司的投资不足;进一步研究发现,在机构投资者持股比例高的公司,长线型基金可抑制现金富余公司的过度投资,非基金、基金(包括长线型基金和短线型基金)都可减缓现金短缺公司的投资不足。研究结论为监管层引导机构持股结构优化、机构持股长期化和公司持股机构化提供了新的思路和证据,同时也深化了对公司投资决策的理解。 相似文献
148.
网络视角下软件产业虚拟集群创新扩散模型研究 总被引:1,自引:0,他引:1
基于传统创新扩散理论和方法,从网络视角出发与传染病模型相结合,探讨软件产业虚拟集群创新扩散机理。由于软件产业虚拟集群的地域分散性,使其创新扩散活动更加复杂,按照集群成员间联系的紧密程度,将成员间创新扩散关系划分为邻居间的创新扩散、同一子集群内的创新扩散和不同子集群间的创新扩散3个层次。借鉴传染病传播思想,考虑创新扩散潜伏期,将软件产业虚拟集群成员分为潜在创新采纳成员、正在进行创新吸收和转化的成员、采用创新并且可将创新扩散给其他企业的成员和自主创新成员4种类型。基于传统的传染病模型,构建软件产业虚拟集群创新扩散模型,讨论不同参数对创新扩散过程的影响,揭示集群创新扩散规律。研究结果表明,邻居关系对创新扩散作用明显;易染系数、潜伏系数越大,创新扩散速度越快;集群网络结构和扩散层次性对创新扩散成员数量、最大值出现的时间均有影响。最后以江苏虚拟软件园为例,验证模型的正确性和适用性。 相似文献
149.
价格折扣呈现方式对促销效果影响的实证研究 总被引:1,自引:0,他引:1
本文按照信息处理这一研究框架,通过两个实验研究了基于金额和基于百分比的两种价格折扣呈现方式对消费者感知价值、购买意愿的影响及其边界条件。由于消费者头脑中处理基于百分比的价格折扣信息比处理基于金额的价格折扣信息具有更大的难度,从而消费者能够对后者产生更高的感知价值和购买意愿。又因为价格折扣计算难易程度和促销品价格是价格呈现形式对影响感知价值的两个边界条件,且价格折扣对购买意愿的影响是通过感知价值这一中介变量得以实现的,因此对于容易计算的价格折扣或者低价促销品,两种折扣形式对消费者感知价值的影响差异将消失。 相似文献
150.
Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this
paper, we investigate the Sensor Scheduling for k-Coverage (SSC) problem which requires to efficiently schedule the sensors, such that the monitored area can be k-covered throughout the whole network lifetime with the purpose of maximizing network lifetime. The SSC problem is NP-hard
and we propose two heuristic algorithms under different scenarios. In addition, we develop a guideline for users to better
design a sensor deployment plan to save energy by employing a density control scheme. Simulation results are presented to
evaluate our proposed algorithms. 相似文献